A Logical Deduction Based Clause Learning Algorithm for Boolean Satisfiability Problems
نویسندگان
چکیده
منابع مشابه
Width-Based Restart Policies for Clause-Learning Satisfiability Solvers
In this paper, we present a new class of restart policies, called width-based policies, for modern clause-learning SAT solvers. The new policies encourage the solvers to find refutation proofs with small widths by determining restarting points based on the sizes of conflict clauses learned rather than the number of conflicts experienced by the solvers. We show that width-based restart policies ...
متن کاملAn algorithm for Boolean satisfiability based on generalized orthonormal expansion
This paper proposes an algorithm for deciding consistency of systems of Boolean equations in several variables with co-efficients in the two element Boolean algebra B0 = {0, 1} and find all satisfying assignments. The algorithm is based on the application of a well known generalized Boole-Shannon orthonormal (ON) expansion of Boolean functions. A necessary and sufficient consistency condition f...
متن کاملSolving Optimal Satisfiability Problems Through Clause - Directed A
Real-world applications, such as diagnosis and embedded control, are increasingly being framed as OpSAT problems problems of finding the best solution that satisfies a formula in propositional state logic. Previous methods, such as Conflict-directed A*, solve OpSAT problems through a weak coupling of A* search, used to generate optimal candidates, and a DPLL-based SAT solver, used to test feasi...
متن کاملComplex Data Mining Algorithm, Based on Logical Deduction Rules
This article considers a method of data mining from text documents by using logical deduction rules. This algorithm is used in information processing of heterogeneous sources. The method allows to mark out a set of data objects from a flow of semistructured full-text information, presented in natural languages, links between data flows, and to form a repository of factual information. This algo...
متن کاملA NN Algorithm for Hard Satisfiability Problems†
Satisfiability (SAT) refers to the task of finding a truth assignment that makes an arbitrary boolean expression true. For example, the boolean expression a & b is true iff the boolean variables a and b are true. Satisfiability is of interest to the logic, operations research, and computational complexity communities. Due to the emphasis of the logic community, traditional satisfiability algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2017
ISSN: 1875-6883
DOI: 10.2991/ijcis.2017.10.1.55